#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;
const int maxn=100000;

struct Ele {
    ll v;
    int id;

    static bool cmp(Ele &a, Ele &b) {return a.v<b.v;}
};

ll gcd(ll a, ll b) {
    for (ll r=a%b; r; a=b, b=r, r=a%b);
    return b;
}

void simplify(ll &a, ll &b) {
    ll t=gcd(a, b);
    a/=t, b/=t;
}

int main() {
    freopen("disanti.in", "r", stdin);
    freopen("disanti.out", "w", stdout);

    static Ele a[maxn+1];
    static ll suf[maxn+2], ans[maxn+2][2];
    int n, c;
    scanf("%d %d", &n, &c);
    for (int i=1; i<=n; i++) {
        scanf("%lld", &a[i].v);
        a[i].id = i;
    }
    sort(a+1, a+n+1, Ele::cmp);

    int tar=0;
    ll pre=0;
    for (int i=n; i>0; i--) suf[i] = suf[i+1]+a[i].v;
    for (int i=1; i<=n; i++) {
        if ((n-i+1)*a[i].v>=suf[i]-c) {
            tar = i;
            break;
        }
    }

    for (int i=1; i<tar; i++) {
        ans[a[i].id][0] = 0;
        ans[a[i].id][1] = 1;
    }
    for (int i=tar; i<=n; i++) {
        ll x=(a[i].v)*(n-tar+1)+c-suf[tar], y=n-tar+1;
        simplify(x, y);
        ans[a[i].id][0]=x, ans[a[i].id][1]=y;
    }

    for (int i=1; i<=n; i++) {
        if (ans[i][1]==1) printf("%lld\n", ans[i][0]);
        else printf("%lld/%lld\n", ans[i][0], ans[i][1]);
    }

    fclose(stdin);
    fclose(stdout);
    return 0;
}
